Learning Binary Preference Relations

نویسندگان

  • Nunung Nurul Qomariyah
  • Dimitar Kazakov
چکیده

It is a truth universally acknowledged that e-commerce platform users in search of an item that best suits their preferences may be o‚ered a lot of choices. An item may be characterised by many aŠributes, which can complicate the process. Here the classic approach in decision support systems to put weights on the importance of each aŠribute is not always helpful as users may €nd it hard to formulate their priorities explicitly. Pairwise comparisons provide an easy way to elicit the user’s preferences in the form of the simplest possible qualitative preferences, which can then be combined to rank the available alternatives. We focus on this type of preference elicitation and learn the individual preference by applying one statistical approach based on Support Vector Machines (SVM), and two logic-based approaches: Inductive Logic Programming (ILP) and Decision Trees. All approaches are compared on two datasets of car preferences and sushi preferences collected from human participants. While in general, the statistical approach has proven its practical advantages, our experiment shows that the logic-based approaches o‚er a number of bene€ts over the one based on statistics. CCS CONCEPTS •Information systems →Recommender systems;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable Forgetting in Preference Relations over Propositional Domains

Representing (and reasoning about) preference relations over combinatorial domains is computationally expensive. We argue that for many problems involving such preferences, it is relevant to simplify them by projecting them on a subset of variables. We investigate several possible definitions, focusing without loss of generality on propositional (binary) variables. We then define the notion of ...

متن کامل

A Method for Aggregating Group Preference Based on Pair-wise Comparison with Random Binary Relations under Interval Belief Structures

Received: 13 Mar. 2012; Revised 21 Jul. 2012; Accepted 11 Aug. 2012e ceived: Jul 8, 2011; RevisedAccepted Jan. 6, Abstract: The aim of this paper is to develop an approach to solve the random lattice order group decision-making problem, where the preference information on alternatives pair provided by experts is in the form of uncertain binary preference relations. In this paper, firstly, the p...

متن کامل

RankPref: Ranking Sentences Describing Relations between Biomedical Entities with an Application

This paper presents a machine learning approach that selects and, more generally, ranks sentences containing clear relations between genes and terms that are related to them. This is treated as a binary classification task, where preference judgments are used to learn how to choose a sentence from a pair of sentences. Features to capture how the relationship is described textually, as well as h...

متن کامل

Mining Preference Relations to Rank Complex Objects

One of the key tasks in data mining and information retrieval is to learn preference relations between objects. Approaches reported in the literature mainly aim at learning preference relations between objects represented according to the classical attribute-value representation. However, the growing interest in data mining techniques able to directly mine data represented according to more sop...

متن کامل

Solving multi-class problems with linguistic fuzzy rule based classification systems based on pairwise learning and preference relations

This paper deals with multi-class classification for linguistic fuzzy rule based classification systems. The idea is to decompose the original data-set into binary classification problems using the pairwise learning approach (confronting all pair of classes), and to obtain an independent fuzzy system for each one of them. Along the inference process, each fuzzy rule based classification system ...

متن کامل

Preference Learning

By combining practical relevance with novel types of prediction problems, the learning from/of preferences has recently received a lot of attention in the machine learning literature. Just as other types of complex learning tasks, preference learning deviates strongly from the standard problems of classification and regression. It is particularly challenging because it involves the prediction o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017